@article{PSW,
  title={A taxonomy of suffix array construction algorithms},
  author={Puglisi, Simon J and Smyth, William F and Turpin, Andrew H},
  journal={acm Computing Surveys (CSUR)},
  volume={39},
  number={2},
  pages={4},
  year={2007},
  publisher={ACM}
}

@article{KoRuSh,
  title={Finding distinct subpalindromes online.},
  author={Kosolobov, Dmitry and Rubinchik, Mikhail and Shur, Arseny M}
}

@incollection{KoRuSh2,
  title={Pal k is Linear Recognizable Online},
  author={Kosolobov, Dmitry and Rubinchik, Mikhail and Shur, Arseny M},
  booktitle={SOFSEM 2015: Theory and Practice of Computer Science},
  pages={289--301},
  year={2015},
  publisher={Springer}
}

@article{DJP,
  title={Episturmian words and some constructions of de Luca and Rauzy},
  author={Droubay, Xavier and Justin, Jacques and Pirillo, Giuseppe},
  journal={Theoretical Computer Science},
  volume={255},
  number={1},
  pages={539--553},
  year={2001},
  publisher={Elsevier}
}

@article{GPR,
  title={Counting distinct palindromes in a word in linear time},
  author={Groult, Richard and Prieur, {\'E}lise and Richomme, Gw{\'e}na{\"e}l},
  journal={Information Processing Letters},
  volume={110},
  number={20},
  pages={908--912},
  year={2010},
  publisher={Elsevier}
}

@article{Manacher,
  title={A New Linear-Time``On-Line''Algorithm for Finding the Smallest Initial Palindrome of a String},
  author={Manacher, Glenn},
  journal={Journal of the ACM (JACM)},
  volume={22},
  number={3},
  pages={346--351},
  year={1975},
  publisher={ACM}
}

@article{Ukk,
  title={On-line construction of suffix trees},
  author={Ukkonen, Esko},
  journal={Algorithmica},
  volume={14},
  number={3},
  pages={249--260},
  year={1995},
  publisher={Springer}
}

@article{Fici,
  title={A subquadratic algorithm for minimum palindromic factorization},
  author={Fici, Gabriele and Gagie, Travis and K{\"a}rkk{\"a}inen, Juha and Kempa, Dominik},
  journal={Journal of Discrete Algorithms},
  volume={28},
  pages={41--48},
  year={2014},
  publisher={Elsevier}
}

@book{PaDi,
  title={Fully persistent arrays},
  author={Dietz, Paul F},
  year={1989},
  publisher={Springer}
}

@inproceedings{PersStruct,
  title={Making data structures persistent},
  author={Driscoll, James R and Sarnak, Neil and Sleator, Daniel Dominic and Tarjan, Robert Endre},
  booktitle={Proceedings of the eighteenth annual ACM symposium on Theory of computing},
  pages={109--121},
  year={1986},
  organization={ACM}
}

@inproceedings{Shallit,
  title={Number of rich binary words of length n},
  journal={The On-Line Encyclopedia of Integer Sequences},
  author={Jeffry Shallit},
  publisher={https://oeis.org/A216264}
}

